Faithful 1-edge fault tolerant graphs
نویسندگان
چکیده
منابع مشابه
Faithful 1-Edge Fault Tolerant Graphs
A graph G* is l-edge fault tolerant with respect to a graph G, denoted by I-EFT( G), if any graph obtained by removing an edge from G’ contains G. A l-Em(G) graph is said to be optimal if it contains the minimum number of edges among all I-EFT( G) graphs. Let Gf be 1 -EJ!T( Gi) for i = 1,2. It can be easily verified that the Cartesian product graph G; x G; is l-edge fault tolerant with respect ...
متن کاملEdge-bipancyclicity of star graphs under edge-fault tolerant
The star graph Sn is one of the most famous interconnection networks. It has been shown by Li [T.-K. Li, Cycle embedding in star graphs with edge faults, Appl. Math. Comput. 167 (2005) 891–900] that Sn contains a cycle of length from 6 to n! when the number of fault edges in the graph does not exceed n 3. In this paper, we improve this result by showing that for any edge subset F of Sn with jFj...
متن کاملEdge-fault-tolerant edge-bipancyclicity of hypercubes
In this paper, we consider the problem embedding a cycle into the hypercube Qn with existence of faulty edges and show that for any edge subset F of Qn with |F | n− 1 every edge of Qn − F lies on a cycle of every even length from 6 to 2n inclusive provided n 4 and all edges in F are not incident with the same vertex. This result improves some known results. 2005 Published by Elsevier B.V.
متن کاملOptimal 1-edge fault-tolerant designs for ladders
A graph G∗ is 1-edge fault-tolerant with respect to a graph G, denoted by 1-EFT(G), if every graph obtained by removing any edge from G∗ contains G. A 1-EFT(G) graph is optimal if it contains the minimum number of edges among all 1-EFT(G) graphs. The kth ladder graph, Lk , is defined to be the cartesian product of the Pk and P2 where Pn is the n-vertex path graph. In this paper, we present seve...
متن کاملRealizability of Fault Tolerant Graphs∗
A connected graph G is optimal-κ if the connectivity κ(G) = δ(G), where δ(G) is the minimum degree of G. It is super-κ if every minimum vertex cut isolates a vertex. An optimal-κ graph G is moptimal-κ if for any vertex set S ⊆ V (G) with |S| ≤ m, G−S is still optimal-κ. The maximum integer of such m, denoted by Oκ(G), is the vertex fault tolerance of G with respect to the property of optimal-κ....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 1997
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(97)00003-3